Efficient Decoding of Systematic (23, 12, 7) and (41, 21, 9) Quadratic Residue Codes
نویسندگان
چکیده
In this paper, a new algorithms decoding the (23, 12, 7) and the (41, 21, 9) Quadratic Residue (QR) codes are presented. The key ideas behind this decoding technique are based on one-to-one mapping between the syndromes “S1” and correctable error patterns. Such algorithms determine the error locations directly by lookup tables without the operations of multiplication over a finite field. Moreover, the method of utilizing shiftsearch algorithm, to dramatically reduce the memory requirement is given for decoding QR codes. The algorithm has been verified through a software simulation that program in C-language. The new approach is modular, regular and naturally suitable for DSP software implementation.
منابع مشابه
Decoding of the Triple-Error-Correcting Binary Quadratic Residue Codes
In this paper, a more efficient syndrome-weight decoding algorithm (SWDA), called the enhanced syndrome-weight decoding algorithm (ESWDA), is presented to decode up to three possible errors for the binary systematic (23, 12, 7) and (31, 16, 7) quadratic residue (QR) codes. In decoding of the QR codes, the evaluation of the error-locator polynomial in the finite field is complicated and time-con...
متن کاملDecoding the (41, 21, 9) Quadratic Residue Code
This paper proposes an algebraic decoding algorithm for the (41, 21, 9) quadratic residue code via Lagrange interpolation formula to determine error check and error locator polynomials. Programs written in C++ language have been executed to check every possible error pattern of this quadratic residue code.
متن کاملDecoding Binary Quadratic Residue codes Using the Euclidean Algorithm
A simplified algorithm for decoding binary quadratic residue (QR) codes is developed in this paper. The key idea is to use the efficient Euclidean algorithm to determine the greatest common divisor of two specific polynomials which can be shown to be the error-locator polynomial. This proposed technique differs from the previous schemes developed for QR codes. It is especially simple due to the...
متن کاملDecoding of the ( 41 , 21 , 9 ) Quadratic Residue Code Using the Gao ’ s Algorithm
In this paper, a decoding method is proposed for the (41, 21, 9) quadratic residue code. The method is acquired through applying the condition of the modified Gao’s algorithm that is similar to fast transform decoding developed by Shiozaki [8]. The property of the syndrome polynomial is used in our decoding method. The new algorithm for has been verified by a software simulation using C languag...
متن کاملDecoding the Ternary (23, 11, 9) Quadratic Residue Code
Quadratic residue (QR) codes are cyclic, nominally half-rate codes, that are powerful with respect to their error-correction capabilities. Decoding QR codes is in general a difficult task, but great progress has been made in the binary case since the work of Elia [1] and He et al. [2]. Decoding algorithms for certain nonbinary QR codes were proposed by Higgs and Humphreys in [3] and [4]. In [5]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 26 شماره
صفحات -
تاریخ انتشار 2010